Removal and Contraction Operations in nD Generalized Maps for Efficient Homology Computation
نویسندگان
چکیده
In this paper, we show that contraction operations preserve the homology of nD generalized maps, under some conditions. This result extends the similar one given for removal operations in [6]. Removal and contraction operations are used to propose an efficient algorithm that compute homology generators of nD generalized maps. Its principle consists in simplifying a generalized map as much as possible by using removal and contraction operations. We obtain a generalized map having the same homology than the initial one, while the number of cells decreased significantly.
منابع مشابه
Removal Operations in nD Generalized Maps for Efficient Homology Computation
In this paper, we present an efficient way for computing homology generators of nD generalized maps. The algorithm proceeds in two steps: (1) cell removals reduces the number of cells while preserving homology; (2) homology generator computation is performed on the reduced object by reducing incidence matrices into their Smith-Agoston normal form. In this paper, we provide a definition of cells...
متن کاملnD generalized map pyramids: Definition, representations and basic operations
Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more topological information than graph pyramids. The main contribution of this work is the definition of pyramids of n-dimensional generalized maps. This extends the previous works to any dimension, and generalizes them in ...
متن کاملBest Proximity Points Results for Cone Generalized Semi-Cyclic φ-Contraction Maps
In this paper, we introduce a cone generalized semi-cyclicφ−contraction maps and prove best proximity points theorems for such mapsin cone metric spaces. Also, we study existence and convergence results ofbest proximity points of such maps in normal cone metric spaces. Our resultsgeneralize some results on the topic.
متن کاملRemoval and Contraction for n-Dimensional Generalized Maps
Removal and contraction are basic operations for several methods conceived in order to handle irregular image pyramids, for multi-level image analysis for instance. Such methods are often based upon graph-like representations which do not maintain all topological information, even for 2-dimensional images. We study the definitions of removal and contraction operations in the generalized maps fr...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.3683 شماره
صفحات -
تاریخ انتشار 2014